Recursive Question Decomposition for Answering Complex Geographic Questions
نویسندگان
چکیده
This paper describes the GIRSA-WP system and the experiments performed for GikiCLEF 2009, the geographic information retrieval task in the question answering track at CLEF 2009. Three runs were submitted. The first one contained only results from the InSicht QA system; it showed high precision, but low recall. The combination with results from the GIR system GIRSA increased recall considerably, but reduced precision. The second run used a standard IR query, while the third run combined such queries with a Boolean query with selected keywords. The evaluation showed that the third run achieved significantly higher mean average precision (MAP) than the second run. In both cases, integrating GIR methods and QA methods was successful in combining their strengths (high precision of deep QA, high recall of GIR), resulting in the third-best performance of automatic runs in GikiCLEF. The overall performance still leaves room for improvements. For example, the multilingual approach is too simple. All processing is done in only one Wikipedia (the German one); results for the nine other languages are collected by following the translation links in Wikipedia.
منابع مشابه
Semantic Decomposition for Question Answering
Appeared in In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI) (edited by Ghallab, Malik; Constantine D. Spyropoulos; Nikos Fakotakis; and Nikos Avouris), pp. 313–317. Patras, Greece. In this paper, we develop and evaluate methods for decomposing complex questions for a question answering system to less complex questions. This aims at increasing the number of corre...
متن کاملMultilayered Question Answering system applied to Temporality evaluation
This paper presents a multilayered Question Answering (QA) architecture suitable for enhancing current QA capabilities with the possibility of processing complex questions. That is, questions whose answer needs to be gathered from pieces of factual information that is scattered in different documents. Specifically, we have designed a specific layer oriented to process the different types of tem...
متن کاملProceedings of the Workshop on Question Answering for Complex Domains
Simple questions require small snippets of text as the answers whereas complex questions require inferencing and synthesizing information from multiple documents to have multiple sentences as the answers. The traditional QA systems can handle simple questions easily but complex questions often need more sophisticated treatment e.g. question decomposition. Therefore, it is necessary to automatic...
متن کاملParallel and Nested Decomposition for Factoid Questions
Typically, automatic Question Answering (QA) approaches use the question in its entirety in the search for potential answers. We argue that decomposing complex factoid questions into separate facts about their answers is beneficial to QA, since an answer candidate with support coming from multiple independent facts is more likely to be the correct one. We broadly categorize decomposable questio...
متن کاملSplitting Complex Temporal Questions for Question Answering Systems
This paper presents a multi-layered Question Answering (Q.A.) architecture suitable for enhancing current Q.A. capabilities with the possibility of processing complex questions. That is, questions whose answer needs to be gathered from pieces of factual information scattered in different documents. Specifically, we have designed a layer oriented to process the different types of temporal questi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009